Does the D(-)/D(+) production asymmetry decrease at large x(F)?
نویسندگان
چکیده
We have applied the meson cloud model to calculate the asymmetries in D and D(s) meson production in high-energy Sigma(-)-nucleus and pi(-)-nucleus collisions. We find a good agreement with recent data. Our results suggest that the asymmetries may decrease at large x(F).
منابع مشابه
2 00 1 Does the D − / D + production asymmetry decrease at large x F ?
We have applied the meson cloud model (MCM) to calculate the asymmetries in D and D s meson production in high energy Σ −-nucleus and π −-nucleus collisions. We find a good agreement with recent data. Our results suggest that the asymmetries may decrease at large x F .
متن کاملEvaluation of Heifer Management Criteria for Improved Lactation and Reduced Dystocia: A Systematic Analysis of Body Weight, Average Daily Gain, and Age
Decisive heifer management for improved lactation and reduced dystocia requires a systematic analysis of age, body weight (BW), and average daily gain (ADG) using an adequately large sample size. The objective of this study was to determine effects of BW and age at first breeding and ADG until pregnancy on yields of milk, milk fat, and milk protein in the first lactation and the occurrence of d...
متن کاملThe structure of ideals, point derivations, amenability and weak amenability of extended Lipschitz algebras
Let $(X,d)$ be a compactmetric space and let $K$ be a nonempty compact subset of $X$. Let $alpha in (0, 1]$ and let ${rm Lip}(X,K,d^ alpha)$ denote the Banach algebra of all continuous complex-valued functions $f$ on$X$ for which$$p_{(K,d^alpha)}(f)=sup{frac{|f(x)-f(y)|}{d^alpha(x,y)} : x,yin K , xneq y}
متن کاملTwin signed total Roman domatic numbers in digraphs
Let $D$ be a finite simple digraph with vertex set $V(D)$ and arcset $A(D)$. A twin signed total Roman dominating function (TSTRDF) on thedigraph $D$ is a function $f:V(D)rightarrow{-1,1,2}$ satisfyingthe conditions that (i) $sum_{xin N^-(v)}f(x)ge 1$ and$sum_{xin N^+(v)}f(x)ge 1$ for each $vin V(D)$, where $N^-(v)$(resp. $N^+(v)$) consists of all in-neighbors (resp.out-neighbors) of $v$, and (...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review letters
دوره 86 24 شماره
صفحات -
تاریخ انتشار 2001